Subtypes for Specifications: Predicate Subtyping in PVS
نویسندگان
چکیده
A specification language used in the context of an effective theorem prover can provide novel features that enhance precision and expressiveness. In particular, typechecking for the language can exploit the services of the theorem prover. We describe a feature called “predicate subtyping” that uses this capability and illustrate its utility as mechanized in PVS. Keywords—Formal methods, specification languages, type systems, subtypes, typechecking, consistency, PVS
منابع مشابه
Subtypes for Speci cations : Predicate
|A speciication language used in the context of an eeective theorem prover can provide novel features that enhance precision and expressiveness. In particular, type-checking for the language can exploit the services of the theorem prover. We describe a feature called \predicate subtyping" that uses this capability and illustrate its utility as mechanized in PVS.
متن کاملSubtypes for Speci cations ?
Speciication languages are best used in environments that provide eeective theorem proving. Having such support available, it is feasible to contemplate forms of typechecking that can use the services of a theorem prover. This allows interesting extensions to the type systems provided for speciication languages. I describe one such extension called \predicate subtyping" and illustrate its utili...
متن کاملPredicate Subtyping with Predicate Sets
We show how PVS-style predicate subtyping can be simulated in HOL using predicate sets, and explain how to perform subtype checking using this model. We illustrate some applications of this to specification and verification in HOL, and also demonstrate some limits of the approach. Finally we report on the effectiveness of a subtype checker used as a condition prover in a contextual rewriter.
متن کاملPVS : Combining Speci cation , Proof Checking , and Model Checking ? To appear in CAV ' 96
PVS (Prototype Veriication System) is an environment for constructing clear and precise speciications and for developing readable proofs that have been mechanically veriied. It is designed to exploit the synergies between language and deduction, automation and interaction, and theorem proving and model checking. For example, the type system of PVS requires the use of theorem proving to establis...
متن کاملAdvanced Theorem Proving Techniques in PVS and Applications
The Prototype Verification System (PVS) is an interactive verification environment that combines a strongly typed specification language with a classical higher-order logic theorem prover. The PVS type system supports: predicate subtypes, dependent types, abstract data types, compound types such as records, unions, and tuples, and basic types such as numbers, Boolean values, and strings. The PV...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Software Eng.
دوره 24 شماره
صفحات -
تاریخ انتشار 1998